Generalization of Pawlak's rough approximation spaces by using δβ-open sets

نویسندگان

  • H. M. Abu-Donia
  • A. S. Salama
چکیده

Article history: Available online 24 May 2012

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Interval Type-2 Fuzzy Rough Sets and Interval Type-2 Fuzzy Closure Spaces

The purpose of the present work is to establish a one-to-one correspondence between the family of interval type-2 fuzzy reflexive/tolerance approximation spaces and the family of interval type-2 fuzzy closure spaces.

متن کامل

S-APPROXIMATION SPACES: A FUZZY APPROACH

In this paper, we study the concept of S-approximation spaces in fuzzy set theory and investigate its properties. Along introducing three pairs of lower and upper approximation operators for fuzzy S-approximation spaces, their properties under different assumptions, e.g. monotonicity and weak complement compatibility are studied. By employing two thresholds for minimum acceptance accuracy and m...

متن کامل

Characterizing Pawlak's Approximation Operators

We investigate the operators associated with approximations in the rough set theory introduced by Pawlak in his [Paw82,MP84] and extensively studied by the Rough Set community [RS06]. We use universal algebra techniques to establish a natural characterization of operators associated with rough sets.

متن کامل

A Note on Belief Structures and S-approximation Spaces

We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempsterchr('39')s multivalued mappings and lower and upper probabilities, and have close relations to rough sets. We show that an S-approximation space, satisfying a monotonicity condition, can induce a natural belief structure which is a fundamental block in evidence theory...

متن کامل

Contributions to the Theory of Rough Sets

We study properties of rough sets, that is, approximations to sets of records in a database or, more formally, to subsets of the universe of an information system. A rough set is a pair hL; U i such that L; U are deenable in the information system and L U. In the paper, we introduce a language, called the language of inclusion-exclusion, to describe incomplete speciications of (unknown) sets. W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Approx. Reasoning

دوره 53  شماره 

صفحات  -

تاریخ انتشار 2012